Adaptive Simulated Annealing for Global Optimization in LS-OPT
نویسندگان
چکیده
The efficient search of global optimal solutions is an important contemporary subject. Different optimization methods tackle the search in different ways. The gradient based methods are among the fastest optimization methods but the final optimal solution depends on the starting point. The global search using these methods is carried out by providing many starting points. Other optimization methods like evolutionary algorithms that mimic the natural processes like evolution, and simulated annealing that emulates the metal cooling process via annealing can find the global optima but are criticized due to high computational expense. The adaptive simulated annealing algorithm has been proposed to be an efficient global optimizer. This algorithm is implemented in LS-OPT. A few analytical examples and meta-model based engineering optimization examples are used to demonstrate the efficiency of the global optimization using ASA. The optimization results are also compared with the existing LFOPC and genetic algorithm optimization methods.
منابع مشابه
An Injection Rate Optimization in a Water Flooding Case Study with an Adaptive Simulated Annealing Techniques
This paper introduces an effective production optimization and a water injection allocation method for oil reservoirs with water injection. In this method, a two-stage adaptive simulated annealing (ASA) is used. A coarse-grid model is made based on average horizon permeability at the beginning iterations of the optimization to search quickly. In the second stage, the fine-grid model is used to ...
متن کاملParallel deterministic and stochastic global minimization of functions with very many minima
The optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm developed at Indiana University.
متن کاملSalo: Combining Simulated Annealing and Local Optimization for Efficient Global Optimization
Simulated annealing is an established method for global optimization. Perhaps its most salient feature is the statistical promise to deliver a globally optimal solution. In this work, we propose a technique which attempts to combine the robustness of annealing in rugged terrain with the efficiency of local optimization methods in simple search spaces. On a variety of benchmark functions, the pr...
متن کاملAdaptive annealing for chaotic optimization
The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...
متن کاملConstrained Multi-global Optimization using a Penalty Stretched Simulated Annealing Framework
This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...
متن کامل